A negative selection algorithm based on hierarchical clustering of self set
نویسندگان
چکیده
منابع مشابه
A Rough Set-Based Hierarchical Clustering Algorithm for Categorical Data
In this paper, rough set theory is applied to the clustering analysis. The clustering decision table is formed through the introduction of decision attribute into data table, thereby further defining the attribute membership matrix. The consistent degree and aggregate degree are present, and their functions in the clustering process are deeply analyzed. The clustering level calculation formula ...
متن کاملA Clustering Algorithm Based on Rough Set and Genetic Algorithm
With the development of computer and information technology, the capacity of data and information is increasing. The processing of data and information becomes the hot issue in the current scientific community. Rough set and genetic algorithm are two data mining and processing technologies which had been commonly used. Rough set can process data quickly and the algorithm is simple. The converge...
متن کاملNGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map
Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...
متن کاملPartition Selection Approach for Hierarchical Clustering Based on Clustering Ensemble
Hierarchical clustering algorithms are widely used in many fields of investigation. They provide a hierarchy of partitions of the same dataset. However, in many practical problems, the selection of a representative level (partition) in the hierarchy is needed. The classical approach to do so is by using a cluster validity index to select the best partition according to the criterion imposed by ...
متن کاملGravitational Based Hierarchical Clustering Algorithm
We propose a new gravitational based hierarchical clustering algorithm using kdtree. kdtree generates densely populated packets and finds the clusters using gravitational force between the packets. Gravitational based hierarchical clustering results are of high quality and robustness. Our method is effective as well as robust. Our proposed algorithm is tested on synthetic dataset and results ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2011
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-011-4323-7